A Multiagent Approach to Qualitative Landmark-Based Navigation
نویسندگان
چکیده
In this paper we present a multiagent system for landmark-based navigation in unknown environments. We propose a bidding mechanism to coordinate the actions requested by the different agents. The navigation system has been tested on a real robot on indoor unstructured environments.
منابع مشابه
Multiagent Bidding Mechanisms for Robot Qualitative Navigation1
This paper explores the use of bidding mechanisms to coordinate the actions requested by a group of agents in charge of achieving the task of guiding a robot towards a specified target in an unknown environment. This approach is based on a qualitative (fuzzy) approach to landmark-based navigation.
متن کاملMultiagent Bidding Mechanisms for Robot Qualitative Navigation
This paper explores the use of bidding mechanisms to coordinate the actions requested by a group of agents in charge of achieving the task of guiding a robot towards a specified target in an unknown environment. This approach is based on a qualitative (fuzzy) approach to landmark-based navigation.
متن کاملEvolving a multiagent system for landmark-based robot navigation
In this article, we build upon a multiagent architecture for landmark-based navigation in unknown environments. In this architecture, each of the agents in the navigation system has a bidding function that is controlled by a set of parameters. We show here the good results obtained by an evolutionary approach that tunes the parameter set values for two navigation tasks. © 2005 Wiley Periodicals...
متن کاملCoarse Qualitative Descriptions in Robot Navigation
This work is about the integration of the skills robot control, landmark recognition, and qualitative reasoning in a single autonomous mobile system. It deals with the transfer of coarse qualitative route descriptions usually given by humans into the domain of mobile robot navigation. An approach is proposed that enables the Bremen Autonomous Wheelchair to follow a route in a building, based on...
متن کاملSolving the flexible job shop problem by hybrid metaheuristics-based multiagent model
The flexible job shop scheduling problem (FJSP) is a generalization of the classical job shop scheduling problem that allows to process operations on one machine out of a set of alternative machines. The FJSP is an NP-hard problem consisting of two sub-problems, which are the assignment and the scheduling problems. In this paper, we propose how to solve the FJSP by hybrid metaheuristics-based c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Auton. Robots
دوره 15 شماره
صفحات -
تاریخ انتشار 2003